A heuristic method for a congested capacitated transit assignment model with strategies

Reliability-Based Transit Assignment for Congested Stochastic Transit Networks

This paper proposes a Nonlinear Complementarity Problem (NCP) formulation for the risk-aversive stochastic transit assignment problem in which in-vehicle travel time, waiting time, capacity and the effect of congestion are considered as stochastic variables simultaneously and both their means and variances are incorporated into the formulation. A new congestion model is developed and captured i...

Capacitated transit assignment with loading priorities

In a transit network involving vehicles with rigid capacities, we advocate the use of strategies for describing consumer behavior. At each boarding node, a user sorts the transit lines in decreasing order of preference, and boards the first vehicle in this list whose residual capacity is nonzero. Since a user’s position in the queue varies from day to day, the delay experienced is stochastic. T...

A Variational Inequality Reformulation of a Congested Transit Assignment Model by Cominetti, Correa, Cepeda, and Florian

In the paper by Cominetti and Correa (2001) [Common-lines and passenger assignment in congested transit networks. Transportation Science 35 (3), pp 250-267], an extension to the common-lines problem for general multidestination networks under congestion is analyzed. Their transit equilibrium assignment model allows for a full representation of congestion effects caused by the variation of effec...

A novel heuristic algorithm for capacitated vehicle routing problem

The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...

Common-Lines and Passenger Assignment in Congested Transit Networks